Interval Scheduling: A Survey
نویسندگان
چکیده
In interval scheduling, not only the processing times of the jobs but also their starting times are given. This paper surveys the area of interval scheduling and presents proofs of results that have been known within the community for some time. We first review the complexity and approximability of different variants of interval scheduling problems. Next, we motivate the relevance of interval scheduling problems by providing an overview of applications that have appeared in literature. Finally, we focus on algorithmic results for two important variants of interval scheduling problems. In one variant we deal with nonidentical machines: instead of each machine being continuously available, there is a given interval for each machine in which it is available. In another variant, the machines are continuously available but they are ordered, and each job has a given ‘maximal’ machine on which it can be processed. We investigate the complexity of these problems and describe algorithms for their solution. Analysis of algorithms, computational complexity: exact algorithms. Production/scheduling, sequencing, deterministic: interval scheduling ∗Antoon Kolen sadly passed away on October 3, 2004. His coauthors dedicate their contribution to this paper to his memory. †CWI, P.O. Box 94079, NL-1090 GB Amsterdam, The Netherlands. E-mail: [email protected] ‡University of California, Berkeley, CA 94720, USA. E-mail: [email protected] §Katholieke Universiteit Leuven, Naamsestraat 69, B-3000, Leuven, Belgium. E-mail: [email protected]
منابع مشابه
New Heuristic Algorithm for Flow Shop Scheduling with 3 Machines and 2 Robots Considering the Breakdown Interval of Machines and Robots Simultaneously
Scheduling is an important subject of production and operations management area. In flow-shop scheduling, the objective is to obtain a sequence of jobs which when processed in a fixed order of machines, will optimize some well defined criteria. The concept of transportation time is very important in scheduling. Transportation can be done by robots. In situations that robots are used to transpor...
متن کاملFlow shop Scheduling Problem with Maintenance Coordination: a New Approach
This study investigates the coordination of production scheduling and maintenance planning in theflow shop scheduling environment. The problem is considered in a bi-objective form, minimizing themakespan as the production scheduling criterion and minimizing the system unavailability as themaintenance planning criterion. The time interval between consecutive maintenance activities as well as the...
متن کاملTask Scheduling in Fog Computing: A Survey
Recently, fog computing has been introducedto solve the challenges of cloud computing regarding Internet objects. One of the challenges in the field of fog computing is the scheduling of tasks requested by Internet objects. In this study, a review of articles related to task scheduling in fog computing has been done. At first, the research questions and goals will be introduced, an...
متن کاملFixed interval scheduling: Models, applications, computational complexity and algorithms
The defining characteristic of fixed interval scheduling problems is that each job has a finite number of fixed processing intervals. A job can be processed only in one of its intervals on one of the available machines, or is not processed at all. A decision has to be made about a subset of the jobs to be processed and their assignment to the processing intervals such that the intervals on the ...
متن کاملA Hybrid Modeling for Continuous Casting Scheduling Problem
This paper deals with a multi-agent-based interval type-2 fuzzy (IT2F) expert systemfor scheduling steel continuous casting. Continuous caster scheduling is a complex and extensiveprocess that needs expert staff. In this study, a distributed multi-agent-based structure is proposed as asolution. The agents used herein can cooperate with each other via various communication protocols.To facilitat...
متن کامل